Exact Convergence Rate for the Maximum of Standardized Gaussian Increments
نویسندگان
چکیده
منابع مشابه
Exact Convergence Rate for the Maximum of Standardized Gaussian Increments
We prove an almost sure limit theorem on the exact convergence rate of the maximum of standardized gaussian random walk increments. This gives a more precise version of Shao’s theorem (Shao, Q.-M., 1995. On a conjecture of Révész. Proc. Amer. Math. Soc. 123, 575-582) in the gaussian case.
متن کاملExtreme-Value Analysis of Standardized Gaussian Increments
Let {Xi, i = 1, 2, . . .} be i.i.d. standard gaussian variables. Let Sn = X1 + . . . + Xn be the sequence of partial sums and Ln = max 0≤i<j≤n Sj − Si √ j − i . We show that the distribution of Ln, appropriately normalized, converges as n → ∞ to the Gumbel distribution. In some sense, the the random variable Ln, being the maximum of n(n+1)/2 dependent standard gaussian variables, behaves like t...
متن کاملThe Rate of Entropy for Gaussian Processes
In this paper, we show that in order to obtain the Tsallis entropy rate for stochastic processes, we can use the limit of conditional entropy, as it was done for the case of Shannon and Renyi entropy rates. Using that we can obtain Tsallis entropy rate for stationary Gaussian processes. Finally, we derive the relation between Renyi, Shannon and Tsallis entropy rates for stationary Gaussian proc...
متن کاملGrowth Rate of Gaussian Processes with Stationary Increments
Communicated by David Blackwell, November 3, 1969 1. Statement of results. Let (Y, «, t^O) be a real, separable Gaussian process with stationary increments, mean 0, and F0 = 0. Let 2Q(t) be the variance of Yt and define Xt = Yt/(2Q(t)yi\ THEOREM 1. Suppose there exists a nonnegative function v(t) such that Q(s + t) Q(s) (*) lim = 1 uniformly in s t~*oo v(s + 0 "~ () and there exist positive con...
متن کاملAsymptotic Convergence Rate of the EM Algorithm for Gaussian Mixtures
It is well known that the convergence rate of the expectation-maximization (EM) algorithm can be faster than those of convention first-order iterative algorithms when the overlap in the given mixture is small. But this argument has not been mathematically proved yet. This article studies this problem asymptotically in the setting of gaussian mixtures under the theoretical framework of Xu and Jo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2008
ISSN: 1083-589X
DOI: 10.1214/ecp.v13-1380